# -*- coding: UTF-8 -*-
from typing import List, Dict
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def checkSubarraySum(self, nums: List[int], k: int) -> bool:
        length = len(nums)

        if length < 2:
            return False

        remainder = 0

        dict: Dict[int, int] = {0: -1}  # -1, 避免nums[0]能够整除k，但是元素个数为1的情况

        for i in range(0, length):
            remainder = (remainder + nums[i]) % k     # 求P[i]
            if dict.get(remainder) is not None:
                index = dict[remainder]
                if i - index >= 2:
                    return True
            else:
                dict[remainder] = i

        return False


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([1,2,3],5, True),
        ([23, 2, 4, 6, 6], 7, True),
        ([23, 2, 4, 6, 7], 6, True),
        ([23, 2, 6, 4, 7], 13, False),
        ([23, 2, 6, 4, 7], 6, True)
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果

        input1 = case_item[0]
        input2 = case_item[1]
        expect = case_item[len(case_item) - 1]

        exec_result = solution.checkSubarraySum(input1, input2)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

